A Pole-Cut Dual Representation and Photoproduction Amplitude with Fixed Cut
نویسندگان
چکیده
منابع مشابه
Maximum Cut Problem, MAX-CUT
The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...
متن کاملProof Fragments, Cut-Elimination and Cut-Introduction
Cut-elimination is usually presented as a set of local proof reduction steps together with a terminating strategy thus showing the existence of cut-free proofs for all provable sequents. Viewing cut-elimination as a transformation of mathematical proofs, not only the existence but also the structure and content of the cut-free proofs deserves investigation. In this paper we use proof skeletons ...
متن کاملDual Band Dual Polarized Slot Cut modified Circular Microstrip Antenna
A new broadband and dual band circular slot cut modified circular microstrip antenna is analyzed and proposed. The parametric study to analyze the effects of circular slot which realizes broader bandwidth is presented. The circular slot creates two additional resonant modes near the fundamental TM11 mode resonance frequency of the equivalent circular patch and yields bandwidth of 202 MHz (8%). ...
متن کاملMultiplicity with a Thrust Cut
We evaluate the multiplicity of hadrons in the e+e−-annihilation at a given thrust T in the modified leading-log approximation, including O( √ αs) corrections. The calculation is done at a large value of τ = 1−T by the use of the factorisation which takes place in the one-particle-inclusive cross section at a given τ . At a small τ , a different type of factorisation takes place, which also ena...
متن کاملUnifying Maximum Cut and Minimum Cut of a Planar Graph
Absfmcf-We consider the real-weight maximum cut of a planar graph. Given an undirected planar graph with real-valued weights associated with its edges, find a partition of the vertices into two nonemply sets such that the sum of the weights of the edges connecting the two sets is maximum. The conventional maximum cut and minimum cut problems assume nonnegative edge weights, and thus are special...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress of Theoretical Physics
سال: 1975
ISSN: 0033-068X,1347-4081
DOI: 10.1143/ptp.53.152